Internal proof calculi for modal logics with separating conjunction
نویسندگان
چکیده
Abstract Modal separation logics are formalisms that combine modal operators to reason locally, with separating connectives allow perform global updates on the models. In this work, we design Hilbert-style proof systems for $\text {MSL}(\ast ,\langle \neq \rangle )$ and ,\Diamond )$, where $\ast $ is conjunction, $\Diamond standard operator $\langle difference modality. The calculi only use logical languages at hand (no external features such as labels) can be divided in two main parts. First, normal forms formulae designed transform every formula into a form. Second, another part of dedicated axiomatization form, which may still require non-trivial developments but more manageable.
منابع مشابه
Implementing Different Proof Calculi for First-order Modal Logics
Modal logics extend classical logic with the modalities ”it is necessarily true that” and ”it is possibly true that” represented by the unary operators 2 and 3, respectively. First-order modal logics (FMLs) extend propositional modal logics by domains specifying sets of objects that are associated with each world, and the standard universal and existential quantifiers [7]. FMLs have many applic...
متن کاملGraphical Sequent Calculi for Modal Logics
The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce’s notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed based on a reformulation of the graphical calculus for classical propositional logic. These graphical calculi are of the nature of deep inference. The relati...
متن کاملLabelled Tableau Calculi for Weak Modal Logics
Many normal and regular modal logics have simple formalizations in terms of labelled tableaux (cf. [3], [4]). But these modal logics have direct characterisation in terms of Kripke frames, and labels are naturally modelled on this kind of semantics. It is an interesting question whether this well known method can be extended to some congruent and monotonic modal logics, which are not characteri...
متن کاملMatrix Proof Methods for Modal Logics
We present matrix proof systems for both constantand varying-domain versions of the first-order modal logics K, K4, D, D4, T, 84 and 86 based on modal versions of Herbrand's Theorem specifically formulated to support efficient automated proof search. The systems treat the mil modal language (no normal-forming) and admit straightforward structure sharing implementations. A key fsature of our app...
متن کاملTableau methods of proof for modal logics
1 Introduction: In [1] Fitch proposed a new proof proceedure for several standard modal logics. The chief characteristic of this was the inclusion in the object language, of symbols representing worlds in Kripke models. In this paper we incorporate the device into a tableau proof system and it is seen that the resulting (propositional) proof system is highly analogous to a classical first order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2021
ISSN: ['1465-363X', '0955-792X']
DOI: https://doi.org/10.1093/logcom/exab016